Permutations and sequences with repetitions by number of increases
نویسندگان
چکیده
منابع مشابه
The number of permutations with a given number of sequences
P (n, s) denotes the number of permutations of 1, 2,. .. n that have exactly s sequences. Canfield and Wilf [math.CO/0609704] recently showed that P (n, s) can be written as a sum of s polynomials in n. We determine these polynomials explicitly and also obtain explicit expressions for P (n, s) and its fixed-s generating function us(x).
متن کاملOn the number of additive permutations and Skolem-type sequences
Cavenagh and Wanless recently proved that, for sufficiently large odd n, the number of transversals in the Latin square formed from the addition table for integers modulo n is greater than (3.246). We adapt their proof to show that for sufficiently large t the number of additive permutations on [−t, t] is greater than (3.246) and we go on to derive some much improved lower bounds on the numbers...
متن کاملPacking densities of layered permutations and the minimum number of monotone sequences in layered permutations
In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from Hästö (2003) and Warren (2004) to compute the permutation packing of permutations whose layer sequence is (1, l1, l2, . . . , lk) with 2−a−1 ≥ k (and similar permutations). As a second result, we prove that the minimum density of monotone sequences of length k + 1 in an arbitraril...
متن کاملRepetitions in Graphs and Sequences
The existence of unavoidable repeated substructures is a known phenomenon implied by the pigeonhole principle and its generalizations. A fundamental problem is to determine the largest size of a repeated substructure in any combinatorial structure from a given class. The strongest notion of repetition is a pair of isomorphic substructures, such as a pair of vertexdisjoint or edge-disjoint isomo...
متن کاملGeometric Crossover for Permutations with Repetitions: Applications to Graph Partitioning
Geometric crossover is a representation-independent generalization of the traditional crossover defined using the distance of the solution space. By choosing a distance firmly rooted in the syntax of the solution representation as basis for geometric crossover, one can design new crossovers for any representation. In previous work we have applied geometric crossover to simple permutations. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory
سال: 1966
ISSN: 0021-9800
DOI: 10.1016/s0021-9800(66)80057-1